New sufficient condition for Hamiltonian graphs
نویسندگان
چکیده
منابع مشابه
New sufficient condition for Hamiltonian graphs
Let G be a graph and α(G) be the independence number of G. For a vertex v ∈ V (G), d(v) and N(v) represent the degree of v and the neighborhood of v in G, respectively. In this paper, we prove that if G is a k-connected graph of order n, and if max{d(v) : v ∈ S} ≥ n/2 for every independent set S of G with |S| = k which has two distinct vertices x, y ∈ S satisfying 1 ≤ |N(x) ∩N(y)| ≤ α(G)− 1, th...
متن کاملA new sufficient condition for hamiltonian graphs
The study of Hamiltonian graphs began with Dirac’s classic result in 1952. This was followed by that of Ore in 1960. In 1984 Fan generalized both these results with the following result: If G is a 2-connected graph of order n and max{d(u), d(v)}≥n/2 for each pair of vertices u and v with distance d(u, v)=2, then G is Hamiltonian. In 1991 Faudree–Gould–Jacobson–Lesnick proved that if G is a 2-co...
متن کاملVariations on a sufficient condition for Hamiltonian graphs
Given a 2-connected graph G on n vertices, let G∗ be its partially square graph, obtained by adding edges uv whenever the vertices u, v have a common neighbor x satisfying the condition NG(x) ⊆ NG[u] ∪ NG[v], where NG[x] = NG(x) ∪ {x}. In particular, this condition is satisfied if x does not center a claw (an induced K1,3). Clearly G ⊆ G∗ ⊆ G, where G is the square of G. For any independent tri...
متن کاملA New Sufficient Condition of Hamiltonian Path
A Hamiltonian path is a spanning path in a graph i.e. a path through every vertex. In this paper we present an interesting sufficient condition for a graph to possess a Hamiltonian path. In particular we prove that the degree sum of all pairwise nonadjacent vertex-triples is greater than 1/2(3n 5) implies that the graph has a Hamiltonian path, where n is the number of vertices of that graph. Al...
متن کاملA New Sufficient Condition for a Digraph to Be Hamiltonian
In 2] the following extension of Meyniels theorem was conjectured: If D is a digraph on n vertices with the property that d(x) + d(y) 2n ? 1 for every pair of non-adjacent vertices x; y with a common out-neighbour or a common in-neighbour, then D is Hamiltonian. We verify the conjecture in the special case where we also require that minfd + (x)+d ? (y); d ? (x)+d + (y)g n ?1 for all pairs of ve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics Letters
سال: 2007
ISSN: 0893-9659
DOI: 10.1016/j.aml.2005.10.024